rule 110 cellular automaton造句

• The book contains a new technical result in describing the Turing completeness of the Rule 110 cellular automaton.
• Cyclic tag systems were created by Matthew Cook and were used in Cook's demonstration that the Rule 110 cellular automaton is universal.
• The Rule 110 cellular automaton, like Conway's Game of Life, exhibits what Stephen Wolfram calls " Class 4 behavior, " which is neither completely random nor completely repetitive.
• Small weakly universal Turing machines that simulate the Rule 110 cellular automaton have been given for the ( 6, 2 ), ( 3, 3 ), and ( 2, 4 ) state-symbol pairs.
• The authoritative manner in which " NKS " presents a vast number of examples and arguments has been criticized as leading the reader to believe that each of these ideas was original to Wolfram; in particular, one of the most substantial new technical results presented in the book, that the rule 110 cellular automaton is Turing complete, was not proven by Wolfram, but by his research assistant, Matthew Cook.